General logical metatheorems for functional analysis
نویسندگان
چکیده
منابع مشابه
General logical metatheorems for functional analysis
In this paper we prove general logical metatheorems which state that for large classes of theorems and proofs in (nonlinear) functional analysis it is possible to extract from the proofs effective bounds which depend only on very sparse local bounds on certain parameters. This means that the bounds are uniform for all parameters meeting these weak local boundedness conditions. The results vastl...
متن کاملSome Logical Metatheorems with Applications in Functional Analysis
In previous papers we have developed proof-theoretic techniques for extracting effective uniform bounds from large classes of ineffective existence proofs in functional analysis. Here ‘uniform’ means independence from parameters in compact spaces. A recent case study in fixed point theory systematically yielded uniformity even w.r.t. parameters in metrically bounded (but noncompact) subsets whi...
متن کاملGeneralized metatheorems on the extractability of uniform bounds in functional analysis
In [6], the second author proved general metatheorems for the extraction of effective uniform bounds from ineffective existence proofs in functional analysis, more precisely from proofs in classical analysis A(:= weakly extensional Peano arithmetic WE-PA in all finite types + quantitifer-free choice + the axiom schema of dependent choice DC) extended with (variants of) abstract bounded metric s...
متن کاملLogical Specifications for Functional Programs
We present a formal method of functional program develop ment based on step by step transformation In their most abstract form speci cations are essentially predicates that relate the result of the speci ed program to the free variables of that pro gram In their most concrete form speci cations are simply programs in a functional programming language Development from abstract speci cations to p...
متن کاملProof Mining in R-trees and Hyperbolic Spaces
This paper is part of the general project of proof mining, developed by Kohlenbach. By ”proof mining” we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs. We present logical metatheorems for classes of spaces from functional analysis and hyperbolic geometry, like Gromov hyperbolic spaces, R-trees and uniformly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2007
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-07-04429-7